Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete
نویسندگان
چکیده
We show that finding a minimal number of landmark nodes for a unique virtual addressing by hop-distances in wireless ad-hoc sensor networks is NPcomplete even if the networks are unit disk graphs that contain only Gabriel edges. This problem is equivalent to Metric Dimension for Gabriel unit disk graphs. The Gabriel edges of a unit disc graph induce a planar O( √ n) distance and an optimal energy spanner. This is one of the most interesting restrictions of Metric Dimension in the context of wireless multi-hop networks.
منابع مشابه
On two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملHow to uniquely determine your location in a graph? A metric dimension problem
The metric dimension problem was first introduced in 1975 by Slater [35], and independently by Harary and Melter [16] in 1976; however the problem for hypercube was studied (and solved asymptotically) much earlier in 1963 by Erdős and Rényi [10]. A set of vertices S resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of...
متن کاملThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملPlanar Metric Dimension is NP-complete
We show that Metric Dimension on planar graphs is NP-complete.
متن کاملOn the Complexity of Metric Dimension
The metric dimension of a graph G is the size of a smallest subset L ⊆ V (G) such that for any x, y ∈ V (G) there is a z ∈ L such that the graph distance between x and z differs from the graph distance between y and z. Even though this notion has been part of the literature for almost 40 years, the computational complexity of determining the metric dimension of a graph is still very unclear. Es...
متن کامل